Predicate Logic with Definitions
نویسنده
چکیده
Predicate Logic with Definitions (PLD or D-logic) is a modification of first-order logic intended mostly for practical formalization of mathematics. The main syntactic constructs of D-logic are terms, formulas and definitions. A definition is a definition of variables, a definition of constants, or a composite definition (D-logic has also abbreviation definitions called abbreviations). Definitions can be used inside terms and formulas. This possibility alleviates introducing new quantifier-like names. Composite definitions allow constructing new definitions from existing ones.
منابع مشابه
Fingerprinting Logic Programs
In this work we present work in progress on functionality duplication detection in logic programs. Eliminating duplicated functionality recently became prominent in context of refactoring. We describe a quantitative approach that allows to measure the “similarity” between two predicate definitions. Moreover, we show how to compute a so-called “fingerprint” for every predicate. Fingerprints capt...
متن کاملCombining Fixed-Point Definitions and Game Semantics in Logic Programming
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability. We extend the operational semantics of these languages with game semantics. This extended semantics has several interesti...
متن کاملA Curry-Style Realizability Interpretation for Monotone Inductive Definitions
The logical system AF2μ, an extension of second-order predicate calculus with monotone inductive definitions, is presented. Some properties of this system are shown including that it is a good system for extracting programs from proofs by means of a realizability interpretation in the style of Krivine-Parigot, where the realizers are terms of the Curry-system of λ-calculus and the realizability...
متن کاملDeclarative Semantics for Contradictory Modular Logic Programs
A complex reasoning system can be designed as an interaction between reasoning modules. A module consists of a declaration of exported/imported predicates and a set of rules containing both negation by default and classical negation. A prioritized modular logic program (PMP) consists of a set of modules and a partial order <def on the predicate definitions (M, p), where M is a module and p is a...
متن کاملA Description Classifier for the Predicate Calculus
A description classifier organizes concepts and relations into a taxonomy based on the results of subsumption computations applied to pairs of relation definitions. Until now, description classifiers have only been designed to operate over definitions phrased in highly restricted subsets of the predicate calculus. This paper describes a classifier able to reason with definitions phrased in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.LO/9906010 شماره
صفحات -
تاریخ انتشار 1999